Communication-Avoiding Symmetric-Indefinite Factorization
نویسندگان
چکیده
منابع مشابه
Communication-Avoiding Symmetric-Indefinite Factorization
We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen’s triangular tridiagonalization. It factors a dense symmetric matrix A as the product A = PLTLP where P is a permutation matrix, L is lower triangular, and T is block tridiagonal and banded. The algorithm is the first symmetric-indefinite communication-avoiding fac...
متن کاملNon-GPU-resident symmetric indefinite factorization
Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, USA Correspondence Ichitaro Yamazaki, Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, USA. Email: [email protected] Funding information National Science Foundation NVIDIAMatrix Algebra for GPU andMulticore Architectures (MAGMA) for Large Petascale Sys...
متن کاملCommunication Avoiding Symmetric Band Reduction
The running time of an algorithm depends on both arithmetic and communication (i.e., data movement) costs, and the relative costs of communication are growing over time. In this work, we present both theoretical and practical results for tridiagonalizing a symmetric band matrix: we present an algorithm that asymptotically reduces communication, and we show that it indeed performs well in practi...
متن کاملNew Pivot Selection for Sparse Symmetric Indefinite Factorization
We propose a new pivot selection technique for symmetric indefinite factorization of sparse matrices. Such factorization should maintain both sparsity and numerical stability of the factors, both of which depend solely on the choices of the pivots. Our method is based on the minimum degree algorithm and also considers the stability of the factors at the same time. Our experiments show that our ...
متن کاملAvoiding Communication through a Multilevel LU Factorization
Due to the evolution of massively parallel computers towards deeper levels of parallelism and memory hierarchy, and due to the exponentially increasing ratio of the time required to transfer data, either through the memory hierarchy or between different compute units, to the time required to compute floating point operations, the algorithms are confronted with two challenges. They need not only...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2014
ISSN: 0895-4798,1095-7162
DOI: 10.1137/130929060